A faster algorithm for betweenness centrality*
نویسندگان
چکیده
منابع مشابه
A Faster Algorithm for Betweenness Centrality
The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest known algorithms require Θ(n) time and Θ(n) space, where n is the number of actors in the network. Motivated by the fast-growing need to compute centrality indices on large, yet very sparse, networks, new algorithms for betweenness are introduced in this paper. They re...
متن کاملA Faster Algorithm for Fully Dynamic Betweenness Centrality
We present a new fully dynamic algorithm for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν · log n) time per update, where n = |V | and ν bounds the number of distinct edges that lie on shortest paths through any single vertex. This...
متن کاملBetweenness Centrality - Incremental and Faster
We present an incremental algorithm that updates the betweenness centrality (BC) score of all vertices in a graph G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O(ν∗ · n) time, where ν∗ is bounded by m∗, the number of edges that lie on a shortest path in G. We achieve the same bound for the more general incremental vertex update ...
متن کاملA Faster Algorithm to Update Betweenness Centrality after Node Alteration
Betweenness centrality is a centrality measure that is widely used, with applications across several disciplines. It is a measure which quantifies the importance of a vertex based on its occurrence in shortest paths between all possible pairs of vertices in a graph. This is a global measure, and in order to find the betweenness centrality of a node, one is supposed to have complete information ...
متن کاملFaster Betweenness Centrality Updates in Evolving Networks
Finding central nodes is a fundamental problem in network analysis. Betweenness centrality is a well-known measure which quantifies the importance of a node based on the fraction of shortest paths going though it. Due to the dynamic nature of many today’s networks, algorithms that quickly update centrality scores have become a necessity. For betweenness, several dynamic algorithms have been pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Mathematical Sociology
سال: 2001
ISSN: 0022-250X,1545-5874
DOI: 10.1080/0022250x.2001.9990249